Decompositions of nearly complete digraphs into t isomorphic parts
نویسندگان
چکیده
An arc decomposition of the complete digraph DKn into t isomorphic subdigraphs is generalized to the case where the numerical divisibility condition is not satisfied. Two sets of nearly tth parts are constructively proved to be nonempty. These are the floor tth class (DKn − R)/t and the ceiling tth class (DKn + S)/t, where R and S comprise (possibly copies of) arcs whose number is the smallest possible. The existence of cyclically 1-generated decompositions of DKn into cycles ~ Cn−1 and into paths ~ Pn is characterized.
منابع مشابه
On some third parts of nearly complete digraphs
For the complete digraph DKn with n¿3, its half as well as its third (or near-third) part, both non-self-converse, are exhibited. A backtracking method for generating a tth part of a digraph is sketched. It is proved that some self-converse digraphs are not among the near-third parts of the complete digraph DK5 in four of the six possible cases. For n = 9 + 6k; k = 0; 1; : : : ; a third part D ...
متن کاملOrthogonal Decompositions of Complete Digraphs
A family G of isomorphic copies of a given digraph ~ G is said to be an orthogonal decomposition of the complete digraph ~ D n by ~ G, if every arc of ~ D n belongs to exactly two members of G and the union of any two diierent elements from G contains precisely one pair of reverse arcs. Given a digraph ~ H, an ~ H-family m ~ H is the vertex-disjoint union of m copies of ~ H. In this paper, we c...
متن کاملAsymptotic Results on Suborthogonal "B"-decompositions of Complete Digraphs
A ~ G-decomposition of a complete digraph ~ D n is a partition of ~ D n into isomorphic copies (called pages) of ~ G. A ~ G-decomposition is said to be suborthogonal if the union of any two pages contains at most one pair of reverse arcs. R. M. Wilson 5] proved in 1975 that a ~ G-decomposition exists for almost all integers n satisfying certain necessary conditions. In this paper we shall prove...
متن کاملThe Erdos-Posa Property for Directed Graphs
A classical result by Erdős and Pósa[3] states that there is a function f : N → N such that for every k, every graph G contains k pairwise vertex disjoint cycles or a set T of at most f(k) vertices such that G− T is acyclic. The generalisation of this result to directed graphs is known as Younger’s conjecture and was proved by Reed, Robertson, Seymour and Thomas in 1996. This so-called Erdős-Pó...
متن کاملTransitive decompositions of graphs
A decomposition of a graph is a partition of the edge set. One can also look at partitions of the arc set but in this talk we restrict our attention to edges. If each part of the decomposition is a spanning subgraph then we call the decomposition a factorisation and the parts are called factors. Decompositions are especially interesting when the subgraphs induced by each part are pairwise isomo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 29 شماره
صفحات -
تاریخ انتشار 2009